Repeated Newsvendor Game with Transshipments

نویسنده

  • Xiao Huang
چکیده

We study a repeated newsvendor game with transshipments. In every period n retailers face a stochastic demand for an identical product and independently place their inventory orders before demand realization. After observing the actual demand, each retailer decides how much of her leftover inventory or unsatisfied demand she wants to share with the other retailers. Residual inventories are then transshipped in order to meet residual demands, and dual allocations are used to distribute residual profit. Unsold inventories are salvaged at the end of the period. While in a single-shot game retailers in an equilibrium withhold their residuals, we show that it is a subgame-perfect Nash equilibrium for the retailers to share all of the residuals when the discount factor is large enough and the game is repeated infinitely many times. We also study asymptotic behavior of the retailers’ order quantities and discount factors when n is large. Finally, we provide conditions under which a system-optimal solution can be achieved in a game with n retailers, and develop a contract for achieving a system-optimal outcome when these conditions are not satisfied. This chapter is based on Huang and Sošić (2010b).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated newsvendor game with transshipments under dual allocations

We study a repeated newsvendor game with transshipments. In every period n retailers face a stochastic demand for an identical product and independently place their inventory orders before demand realization. After observing the actual demand, each retailer decides how much of her leftover inventory or unsatisfied demand she wants to share with the other retailers. Residual inventories are then...

متن کامل

Supplement to “ Repeated Newsvendor Game with Transshipments under Dual Allocations ” – Technical Appendix

Proof of Theorem 3: In order to prove this theorem, we first introduce the following notation: let Fm(y) = P{ ∑m i=1Di ≤ y}, F̂m(y) = P{ 1 m ∑m i=1Di ≤ y}, and E[Di] = μ. Note that Fm(y) = F̂m( y m). We will also need the following lemmas. Lemma A1. In an inventory-sharing game with symmetric retailers facing strictly increasing and independent distribution functions, a retailer defecting from st...

متن کامل

A Two-Location Inventory Model with Transshipment and Local Decision Making

In situations where a seller has surplus stock and another seller is stocked out, it may be desirable to transfer surplus stock from the former to the latter. We examine how the possibility of such transshipments between two independent locations affects the optimal inventory orders at each location. If each location aims to maximize its own profits—we call this local decision making—their inve...

متن کامل

Multiobjective Analysis of the Multi-Location Newsvendor and Transshipment Models

Unlike the Newsvendor model, a system based on lateral transshipments allows the unsold inventories to be moved from locations with surplus inventory to fulfill more unmet demands at stocked out locations. Both models were thoroughly studied and researches were usually confined to cost minimization or profit maximization. In this paper, we proposed a more realistic multiobjective study of both ...

متن کامل

Transshipment of Inventories: Dual Allocations vs. Transshipment Prices

We study a newsvendor game with transshipments, in which n retailers face a stochastic demand for an identical product. Before the demand is realized, each retailer independently orders her initial inventory. After the demand is realized, the retailers select an optimal transshipment pattern and ship residual inventories in order to meet residual demands. Unsold inventories are salvaged at the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011